Analysis of the KDD Cup 2009: Fast Scoring on a Large Orange Customer Database
نویسندگان
چکیده
We organized the KDD cup 2009 around a marketing problem with the goal of identifying data mining techniques capable of rapidly building predictive models and scoring new entries on a large database. Customer Relationship Management (CRM) is a key element of modern marketing strategies. The KDD Cup 2009 offered the opportunity to work on large marketing databases from the French Telecom company Orange to predict the propensity of customers to switch provider (churn), buy new products or services (appetency), or buy upgrades or add-ons proposed to them to make the sale more profitable (up-selling). The challenge started on March 10, 2009 and ended on May 11, 2009. This challenge attracted over 450 participants from 46 countries. We attribute the popularity of the challenge to several factors: (1) A generic problem relevant to the Industry (a classification problem), but presenting a number of scientific and technical challenges of practical interest including: a large number of training examples (50,000) with a large number of missing values (about 60%) and a large number of features (15,000), unbalanced class proportions (fewer than 10% of the examples of the positive class), noisy data, presence of categorical variables with many different values. (2) Prizes (Orange offered 10,000 Euros in prizes). (3) A well designed protocol and web site (we benefitted from past experience). (4) An effective advertising campaign using mailings and a teleconference to answer potential participants questions. The results of the challenge were discussed at the KDD conference (June 28, 2009). The principal conclusions are that ensemble methods are very effective and that ensemble of decision trees offer off-the-shelf solutions to problems with large numbers of samples and attributes, mixed types of variables, and lots of missing values. The data and the platform of the challenge remain available for research and educational purposes at http://www.kddcup-orange.com/.
منابع مشابه
The 2009 Knowledge Discovery in Data Competition ( KDD Cup 2009 ) Challenges in Machine Learning
We organized the KDD cup 2009 around a marketing problem with the goal of identifying data mining techniques capable of rapidly building predictive models and scoring new entries on a large database. Customer Relationship Management (CRM) is a key element of modern marketing strategies. The KDD Cup 2009 offered the opportunity to work on large marketing databases from the French Telecom company...
متن کاملA Combination of Boosting and Bagging for KDD Cup 2009 - Fast Scoring on a Large Database
We present the ideas and methodologies that we used to address the KDD Cup 2009 challenge on rank-ordering the probability of churn, appetency and up-selling of wireless customers. We choose stochastic gradient boosting tree (TreeNet R ) as our main classifier to handle this large unbalanced dataset. In order to further improve the robustness and accuracy of our results, we bag a series of boos...
متن کاملWinning the KDD Cup Orange Challenge with Ensemble Selection
We describe our wining solution for the KDD Cup Orange Challenge.
متن کاملPredicting customer behaviour: The University of Melbourne's KDD Cup report
We discuss the challenges of the 2009 KDD Cup along with our ideas and methodologies for modelling the problem. The main stages included aggressive nonparametric feature selection, careful treatment of categorical variables and tuning a gradient boosting machine under Bernoulli loss with trees.
متن کاملLogistic Model Trees with AUC Split Criterion for the KDD Cup 2009 Small Challenge
In this work, we describe our approach to the “Small Challenge” of the KDD cup 2009, the prediction of three aspects of customer behavior for a telecommunications service provider. Our most successful method was a Logistic Model Tree with AUC as split criterion using predictions from boosted decision stumps as features. This was the best submission for the “Small Challenge” that did not use add...
متن کامل